Supporting Information for the Paper: Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five, IEEE Trans. Inform. Theory, To Appear
نویسندگان
چکیده
9 〈35, 9, 2, 1〉 〈3, 50, 56, 1〉 〈10, 52, 34, 2〉 〈31, 44, 29, 0〉 〈37, 49, 17, 2〉 〈40, 39, 13, 0〉 〈1, 15, 53, 0〉 〈36, 7, 30, 2〉 〈11, 52, 48, 0〉 〈32, 43, 33, 2〉 〈38, 28, 56, 2〉 〈41, 36, 11, 1〉 〈12, 24, 9, 2〉 〈41, 1, 22, 2〉 〈23, 26, 35, 2〉 〈32, 55, 15, 1〉 〈38, 36, 54, 0〉 〈49, 35, 43, 0〉 〈28, 37, 2, 0〉 〈41, 6, 27, 0〉 〈26, 47, 18, 0〉 〈33, 20, 13, 1〉 〈40, 37, 42, 1〉 〈51, 24, 43, 1〉 〈29, 28, 6, 1〉 〈48, 0, 16, 2〉 〈27, 51, 40, 2〉 〈34, 38, 27, 1〉
منابع مشابه
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...
متن کاملOn constant-composition codes over Zq
A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the -ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham–Sloane bound for binary constant-wei...
متن کاملConstructions for optimal constant weight cyclically permutable codes and difference families
A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...
متن کاملOptimal ternary constant-composition codes with weight four and distance six
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of len...
متن کاملSome new results for optimal ternary linear codes
Let ( ) be the maximum possible minimum Hamming distance of a ternary [ ]-code for given values of and . We describe a package for code extension and use this to prove some new exact values of ( ). Moreover, we classify the ternary [ ( )]-codes for some values of and .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.0392 شماره
صفحات -
تاریخ انتشار 2010